A New Human Identification Protocol and Coppersmith's Baby-Step Giant-Step Algorithm
نویسندگان
چکیده
We propose a new protocol providing cryptographically secure authentication to unaided humans against passive adversaries. We also propose a new generic passive attack on human identification protocols. The attack is an application of Coppersmith’s baby-step giantstep algorithm on human identification protcols. Under this attack, the achievable security of some of the best candidates for human identification protocols in the literature is further reduced. We show that our protocol preserves similar usability while achieves better security than these protocols. A comprehensive security analysis is provided which suggests parameters guaranteeing desired levels of security.
منابع مشابه
A New Baby-Step Giant-Step Algorithm and Some Applications to Cryptanalysis
We describe a new variant of the well known Baby-Step Giant-Step algorithm in the case of some discrete logarithms with a special structure. More precisely, we focus on discrete logarithms equal to products in groups of unknown order. As an example of application, we show that this new algorithm enables to cryptanalyse a variant of the GPS scheme proposed by Girault and Lefranc at CHES 2004 con...
متن کاملA Probabilistic Baby-step Giant-step Algorithm
In this paper, a new algorithm to solve the discrete logarithm problem is presented which is similar to the usual baby-step giant-step algorithm. Our algorithm exploits the order of the discrete logarithm in the multiplicative group of a finite field. Using randomization with parallelized collision search, our algorithm indicates some weakness in NIST curves over prime fields which are consider...
متن کاملBaby-Step Giant-Step Algorithms for Non-uniform Distributions
The baby-step giant-step algorithm, due to Shanks, may be used to solve the discrete logarithm problem in arbitrary groups. The paper explores a generalisation of this algorithm, where extra baby steps may be computed after carrying out giant steps (thus increasing the giant step size). The paper explores the problem of deciding how many, and when, extra baby steps should be computed so that th...
متن کاملExtending Baby-step Giant-step algorithm for FACTOR problem
Recently, a non-abelian factorization problem together with an associated asymmetric encryption scheme were introduced in [1]. We show how a classical baby-step giant-step algorithm for discrete logarithm can be extended to this problem. This contradicts the claims regarding the complexity of the proposed problem.
متن کاملA New Two Step Induction Protocol for Neural Differentiation of Human Umbilical Cord Blood-Derived Mesenchymal Stem Cells
Background: In this study, we examined a new two step induction protocol for improving the differentiation of human umbilical cord blood-derived mesenchymal stem cells into neural progenitor cells. Materials and Methods: Human umbilical cord blood-derived mesenchymal stem cells were first cultured in Dulbecco’s modified eagle medium supplemented with 10% fetal bovine serum in a humidified incu...
متن کامل